Method and apparatus for merge mode in video coding

ABSTRACT

An apparatus and method for generating a merge candidate list for encoding or decoding of a video sequence includes performing a first search round. A first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) is identified based on the first search round. An n-th search round is performed. An n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) is identified based on the n-th search round. The merge candidate list is generated using the first set of motion vector predictors and the n-th set of motion vector predictors.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority under 35 U.S.C. § 119 to U.S. Application No. 62/712,043, filed on Jul. 30, 2018, in the United States Patent & Trademark Office, the disclosure of which is incorporated herein by reference in its entirety.

FIELD

The present disclosure is directed to methods for inter-picture prediction coding, especially for merge mode. Extra spatial or temporal merge candidates are inserted into the merge candidates list. The construction of the merge candidate list is modified.

BACKGROUND

In High Efficiency Video Coding (HEVC), a merge mode for Inter-picture prediction is introduced. A merge candidate list of candidate motion parameters from neighboring blocks is constructed. Then an index is signaled which identifies the candidates to be used. Merge mode also allows for temporal prediction by including into the list a candidate obtained from previously coded pictures. In HEVC, the merge candidates list is constructed based on the following candidates: up to four spatial merge candidates that are derived from five spatial neighboring blocks, and additional merge candidates including combined bi-predictive candidates and zero motion vector candidates.

In HEVC, a skip mode is used to indicate for a block that the motion data is inferred instead of explicitly signaled ad that the prediction residual is zero, i.e. no transform coefficients are transmitted. In HEVC, at the beginning of each CU in an inter-picture prediction slice, a skip_flag is signaled that implies the following: the CU only contains one PU (2N×2N), the merge mode is used to derive the motion data, and no residual data is present in the bitstream.

In current VVC (Versatile Video Coding) development, some new merge candidates were introduced. The sub-CU modes are enabled as additional merge candidates and there is no additional syntax element required to signal the modes. Two additional merge candidates are added to merge candidates list of each CU to represent the ATMVP mode and STMVP mode. Up to seven merge candidates are used, if the sequence parameter set indicates that ATMVP and STMVP are enabled. The encoding logic of the additional merge candidates is the same as for the merge candidates in the HEVC, which means, for each CU in P or B slice, two more RD checks are needed for the two additional merge candidates. In JEM, the order of the inserted merge candidates is A, B, C, D, ATMVP, STMVP, E (when the merge candidates in the list are less than 6), TMVP, combined bi-predictive candidates and zero motion vector candidates.

In the current VVC, all bins of merge index are context coded by CABAC. While in HEVC, only the first bin is context coded and the remaining bins are context by-pass coded. In the current VVC, the maximum number of merge candidates are 7.

In some techniques, a scheme searches the candidate motion vectors from previously coded blocks, with a step size of 8×8 block. It defines the nearest spatial neighbors, i.e., immediate top row, left column, and top-right corner, as category 1. The outer regions (maximum three 8×8 blocks away from the current block boundary) and the collocated blocks in the previously coded frame are classified as category 2. The neighboring blocks that are predicted from different reference frames or are intra coded are pruned from the list. The remaining reference blocks are then each assigned a weight. The weight is related to the distance to the current block.

The additional merge candidates will be a direct extension of the NEXT merge candidates. The left, above, left bottom, above right, and top left candidates that are not immediately next to the current block are checked.

As an example, a top left corner of a reference block has an offset of (−96, −96) to the current block. Each candidate Bi or Ci has an offset of height in the vertical direction compared to its previous B or C candidates. Each candidate Ai or Di has an offset of block width in the horizontal direction compared to its previous A or D candidates. Each Ei has an offset of width and height in both horizontal direction and vertical direction compared to its previous E candidates. The candidates are checked from inside to the outside. And the order of the candidates is Ai, Bi, Ci, Di, and Ei.

SUMMARY

According to an aspect of the disclosure, a method for generating a merge candidate list for encoding or decoding of a video sequence comprises: performing a first search round; identifying a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) based on the first search round; performing an n-th search round; identifying an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on the n-th search round; and generating the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors.

According to an aspect of the disclosure, a device for generating a merge candidate list for encoding or decoding of a video sequence comprises: at least one memory configured to store program code; at least one processor configured to read the program code and operate as instructed by the program code, the program code including: identifying code configured to cause the at least one processor to identify a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) based on the first search round; wherein the performing code is further configured to cause the at least one processor to perform an n-th search round; wherein the identifying code is further configured to cause the at least one processor to identify an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on the n-th search round; and generating code configured to cause the at least one processor to generate the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors.

According to an aspect of the disclosure, a non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of a device, cause the one or more processors to: perform a first search round; identify a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) based on the first search round; perform an n-th search round; identify an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on the n-th search round; and generate the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a flowchart of an example process for generating a merge candidate list for encoding or decoding of a video sequence.

FIG. 2 is a simplified block diagram of a communication system according to an embodiment of the present disclosure.

FIG. 3 is a diagram of the placement of a video encoder and decoder in a streaming environment.

FIG. 4 is a functional block diagram of a video decoder according to an embodiment of the present disclosure.

FIG. 5 is a functional block diagram of a video encoder according to an embodiment of the present disclosure.

FIG. 6 is a diagram of a computer system in accordance with an embodiment.

FIG. 7 is a diagram illustrating a search pattern in accordance with an embodiment.

FIG. 8 is a diagram illustrating a search pattern in accordance with an embodiment.

FIG. 9 is a diagram illustrating a search pattern in accordance with an embodiment.

FIG. 10 is a diagram illustrating a search pattern in accordance with an embodiment.

PROBLEM TO BE SOLVED

The present disclosure is directed to obtaining spatial motion vector predictors for inter-picture prediction coding. The methods proposed in this disclosure can be applied to both merge mode or motion vector prediction with difference coding. They may be also combined with any temporal motion vector prediction methods. For the combination, temporal motion vector predictors may be inserted between/among the proposed spatial motion vector predictors in any order. In the following disclosure, merge mode is used for detailed discussion. It is proposed to introduce more variety in the search pattern of extended spatial merge candidates. The proposed methods in this disclosure can be easily extended to any video coding method that uses the merge concept. Since skip mode will use merge mode to derive the motion information, the methods in this invention can also apply to skip mode.

DETAILED DESCRIPTION

FIG. 1 is a flowchart of an example process 100 for a method for generating a merge candidate list for encoding or decoding of a video sequence. In some implementations, one or more process blocks of FIG. 1 may be performed by a decoder. In some implementations, one or more process blocks of FIG. 1 may be performed by another device or a group of devices separate from or including a decoder, such as an encoder.

As shown in FIG. 1, process 100 may include performing a first search round (block 110). As further shown in FIG. 1, process 100 may include identifying a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) based on the first search round (block 120). As further shown in FIG. 1, process 100 may include performing a second search round (block 130). As further shown in FIG. 1, process 100 may include identifying a second set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on the second search round (block 140). As further shown in FIG. 1, process 100 may include determining whether another search round is to be performed (block 150). For example, the device may determine whether another search round is to be performed based on a maximum search range, a maximum number of search rounds, based on signaled information, based on predetermined information, and/or the like. If another search round is to be performed (block 150—YES), then process 100 may include performing another search round. It should be understood that n search rounds may be performed. If another search round is not to be performed (block 150—NO), then process 100 may include generating the merge candidate list using identified motion vector predictors (block 160).

Although FIG. 1 shows example blocks of process 100, in some implementations, process 100 may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in FIG. 1. Additionally, or alternatively, two or more of the blocks of process 100 may be performed in parallel.

FIG. 2 illustrates a simplified block diagram of a communication system (200) according to an embodiment of the present disclosure. The communication system (200) may include at least two terminals (210-220) interconnected via a network (250). For unidirectional transmission of data, a first terminal (210) may code video data at a local location for transmission to the other terminal (220) via the network (250). The second terminal (220) may receive the coded video data of the other terminal from the network (250), decode the coded data and display the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

FIG. 2 illustrates a second pair of terminals (230, 240) provided to support bidirectional transmission of coded video that may occur, for example, during videoconferencing. For bidirectional transmission of data, each terminal (230, 240) may code video data captured at a local location for transmission to the other terminal via the network (250). Each terminal (230, 240) also may receive the coded video data transmitted by the other terminal, may decode the coded data and may display the recovered video data at a local display device.

In FIG. 2, the terminals (210-240) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure are not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (250) represents any number of networks that convey coded video data among the terminals (210-240), including for example wireline and/or wireless communication networks. The communication network (250) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (250) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 3 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (313), that can include a video source (301), for example a digital camera, creating, for example, an uncompressed video sample stream (302). That sample stream (302), depicted as a bold line to emphasize a high data volume when compared to encoded video bitstreams, can be processed by an encoder (303) coupled to the camera 301). The encoder (303) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video bitstream (304), depicted as a thin line to emphasize the lower data volume when compared to the sample stream, can be stored on a streaming server (305) for future use. One or more streaming clients (306, 308) can access the streaming server (305) to retrieve copies (307, 309) of the encoded video bitstream (304). A client (306) can include a video decoder (310) which decodes the incoming copy of the encoded video bitstream (307) and creates an outgoing video sample stream (311) that can be rendered on a display (312) or other rendering device (not depicted). In some streaming systems, the video bitstreams (304, 307, 309) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. Under development is a video coding standard informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

FIG. 4 may be a functional block diagram of a video decoder (310) according to an embodiment of the present invention.

A receiver (410) may receive one or more codec video sequences to be decoded by the decoder (310); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (412), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (410) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (410) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (415) may be coupled in between receiver (410) and entropy decoder/parser (420) (“parser” henceforth). When receiver (410) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosychronous network, the buffer (415) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer (415) may be required, can be comparatively large and can advantageously of adaptive size.

The video decoder (310) may include a parser (420) to reconstruct symbols (421) from the entropy coded video sequence. Categories of those symbols include information used to manage operation of the decoder (310), and potentially information to control a rendering device such as a display (312) that is not an integral part of the decoder but can be coupled to it, as was shown in FIG. 4. The control information for the rendering device(s) may be in the form of Supplementary Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (420) may parse/entropy-decode the coded video sequence received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow principles well known to a person skilled in the art, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (420) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameters corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The entropy decoder/parser may also extract from the coded video sequence information such as transform coefficients, quantizer parameter (QP) values, motion vectors, and so forth.

The parser (420) may perform entropy decoding/parsing operation on the video sequence received from the buffer (415), so to create symbols (421). The parser (420) may receive encoded data, and selectively decode particular symbols (421). Further, the parser (420) may determine whether the particular symbols (421) are to be provided to a Motion Compensation Prediction unit (453), a scaler/inverse transform unit (451), an Intra Prediction Unit (452), or a loop filter (456).

Reconstruction of the symbols (421) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (420). The flow of such subgroup control information between the parser (420) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, decoder (310) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (451). The scaler/inverse transform unit (451) receives quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (621) from the parser (420). It can output blocks comprising sample values, that can be input into aggregator (455).

In some cases, the output samples of the scaler/inverse transform (451) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (452). In some cases, the intra picture prediction unit (452) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current (partly reconstructed) picture (454). The aggregator (455), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (452) has generated to the output sample information as provided by the scaler/inverse transform unit (451).

In other cases, the output samples of the scaler/inverse transform unit (451) can pertain to an inter coded, and potentially motion compensated block. In such a case, a Motion Compensation Prediction unit (453) can access reference picture memory (457) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (421) pertaining to the block, these samples can be added by the aggregator (455) to the output of the scaler/inverse transform unit (in this case called the residual samples or residual signal) so to generate output sample information. The addresses within the reference picture memory form where the motion compensation unit fetches prediction samples can be controlled by motion vectors, available to the motion compensation unit in the form of symbols (421) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (455) can be subject to various loop filtering techniques in the loop filter unit (456). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video bitstream and made available to the loop filter unit (456) as symbols (421) from the parser (420), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (456) can be a sample stream that can be output to the render device (312) as well as stored in the reference picture memory (456) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. Once a coded picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, parser (420)), the current reference picture (656) can become part of the reference picture buffer (457), and a fresh current picture memory can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (310) may perform decoding operations according to a predetermined video compression technology that may be documented in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that it adheres to the syntax of the video compression technology or standard, as specified in the video compression technology document or standard and specifically in the profiles document therein. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (410) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder (310) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal-to-noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 5 may be a functional block diagram of a video encoder (303) according to an embodiment of the present disclosure.

The encoder (303) may receive video samples from a video source (301) (that is not part of the encoder) that may capture video image(s) to be coded by the encoder (303).

The video source (301) may provide the source video sequence to be coded by the encoder (303) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ) and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (301) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (303) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the encoder (303) may code and compress the pictures of the source video sequence into a coded video sequence (543) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of Controller (550). Controller controls other functional units as described below and is functionally coupled to these units. The coupling is not depicted for clarity. Parameters set by controller can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. A person skilled in the art can readily identify other functions of controller (550) as they may pertain to video encoder (303) optimized for a certain system design.

Some video encoders operate in what a person skilled in the art readily recognizes as a “coding loop.” As an oversimplified description, a coding loop can consist of the encoding part of an encoder (530) (“source coder” henceforth) (responsible for creating symbols based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (533) embedded in the encoder (303) that reconstructs the symbols to create the sample data that a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). That reconstructed sample stream is input to the reference picture memory (534). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the reference picture buffer content is also bit exact between local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is well known to a person skilled in the art.

The operation of the “local” decoder (533) can be the same as of a “remote” decoder (310), which has already been described in detail above in conjunction with FIG. 4. Briefly referring also to FIG. 5, however, as symbols are available and en/decoding of symbols to a coded video sequence by entropy coder (545) and parser (420) can be lossless, the entropy decoding parts of decoder (310), including channel (412), receiver (410), buffer (415), and parser (420) may not be fully implemented in local decoder (533).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

As part of its operation, the source coder (530) may perform motion compensated predictive coding, which codes an input frame predictively with reference to one or more previously-coded frames from the video sequence that were designated as “reference frames.” In this manner, the coding engine (532) codes differences between pixel blocks of an input frame and pixel blocks of reference frame(s) that may be selected as prediction reference(s) to the input frame.

The local video decoder (533) may decode coded video data of frames that may be designated as reference frames, based on symbols created by the source coder (530). Operations of the coding engine (532) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 5), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (533) replicates decoding processes that may be performed by the video decoder on reference frames and may cause reconstructed reference frames to be stored in the reference picture cache (534). In this manner, the encoder (303) may store copies of reconstructed reference frames locally that have common content as the reconstructed reference frames that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (535) may perform prediction searches for the coding engine (532). That is, for a new frame to be coded, the predictor (535) may search the reference picture memory (534) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (535) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (535), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (534).

The controller (550) may manage coding operations of the video coder (530), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (545). The entropy coder translates the symbols as generated by the various functional units into a coded video sequence, by loss-less compressing the symbols according to technologies known to a person skilled in the art as, for example Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (540) may buffer the coded video sequence(s) as created by the entropy coder (545) to prepare it for transmission via a communication channel (560), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (540) may merge coded video data from the video coder (530) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (550) may manage operation of the encoder (303). During coding, the controller (550) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following frame types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other frame in the sequence as a source of prediction. Some video codecs allow for different types of Intra pictures, including, for example Independent Decoder Refresh Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A Predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A Bi-directionally Predictive Picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded non-predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference pictures. Blocks of B pictures may be coded non-predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video coder (303) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video coder (303) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (540) may transmit additional data with the encoded video. The video coder (530) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, Supplementary Enhancement Information (SEI) messages, Visual Usability Information (VUI) parameter set fragments, and so on.

Further, the proposed methods may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium to perform one or more of the proposed methods.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 6 shows a computer system 600 suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 6 for computer system 600 are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system 600.

Computer system 600 may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard 601, mouse 602, trackpad 603, touch screen 610, data-glove 1204, joystick 605, microphone 606, scanner 607, camera 608.

Computer system 600 may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen 610, data-glove 1204, or joystick 605, but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers 609, headphones (not depicted)), visual output devices (such as screens 610 to include cathode ray tube (CRT) screens, liquid-crystal display (LCD) screens, plasma screens, organic light-emitting diode (OLED) screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system 600 can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW 620 with CD/DVD or the like media 621, thumb-drive 622, removable hard drive or solid state drive 623, legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system 600 can also include interface(s) to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include global systems for mobile communications (GSM), third generation (3G), fourth generation (4G), fifth generation (5G), Long-Term Evolution (LTE), and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (649) (such as, for example universal serial bus (USB) ports of the computer system 600; others are commonly integrated into the core of the computer system 600 by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system 600 can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core 640 of the computer system 600.

The core 640 can include one or more Central Processing Units (CPU) 641, Graphics Processing Units (GPU) 642, specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) 643, hardware accelerators for certain tasks 644, and so forth. These devices, along with Read-only memory (ROM) 645, Random-access memory (RAM) 646, internal mass storage such as internal non-user accessible hard drives, solid-state drives (SSDs), and the like 647, may be connected through a system bus 1248. In some computer systems, the system bus 1248 can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus 1248, or through a peripheral bus 649. Architectures for a peripheral bus include peripheral component interconnect (PCI), USB, and the like.

CPUs 641, GPUs 642, FPGAs 643, and accelerators 644 can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM 645 or RAM 646. Transitional data can be also be stored in RAM 646, whereas permanent data can be stored for example, in the internal mass storage 647. Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU 641, GPU 642, mass storage 647, ROM 645, RAM 646, and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture 600, and specifically the core 640 can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core 640 that are of non-transitory nature, such as core-internal mass storage 647 or ROM 645. The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core 640. A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core 640 and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM 646 and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator 644), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

FIG. 7 is a diagram illustrating a search pattern in accordance with an embodiment. As shown in FIG. 7, the candidate blocks Ci and Di are extended in the diagonal direction instead of a vertical/horizontal direction. As shown, the candidate block Ci's horizontal offset to Ei is i*2*gridX+width+4. In this case, “gridX” is the horizontal grid size. In another embodiment, the candidate block Ci can have a horizontal offset to Ei as i*2*gridX+width. The candidate block Di's vertical offset to Ei is i*2*gridY+height+4. In another embodiment, the candidate block Di can have a vertical offset to Ei as i*2*gridY+height. In the above description, “gridX” and “gridY” are the grid size of the search, and the width and height are the current block width and height.

To further illustrate the positions of the candidate blocks Ci and Di, it can be observed that the candidate blocks Ci and Ei are mirrored about imaginary lines that cross through the center of the current block in the vertical direction and horizontal direction, respectively.

FIG. 8 is a diagram illustrating a search pattern in accordance with an embodiment.

As shown in FIG. 8, the candidate blocks Ai, Bi, Ci, Di are all extended in the diagonal direction. For each i round, a new candidate block may be generated. The block top left corner has an offset to the current block. The offset is calculated as follows: Offsetx=−i*gridX Offsety=−i*gridY. In the foregoing equation, “gridX” and “grid Y” are the grid size of the search, and “Offsetx” and “Offsety” denote the new block's offset to the current block.

In an embodiment, the values for “gridX” and “gridY” can be fixed. In another embodiment, the value for “gridX” can be the current block width, and the “gridY” can be the current block height. The width and height of the new block is calculated as below: newWidth=i*2*gridX+width newHeight=i*2*gridY+height. In the foregoing equation, the width and height are the current block width and height. The values for “newWidth” and “newHeight” are the new block width and height. In this case, the extended non-adjacent merge candidate can be treated as an extension of the current block. The candidate blocks Ai, Bi, Ci, Di, Ei are the above, left, above right, left bottom, above left candidates of the new block.

FIG. 9 is a diagram illustrating a search pattern in accordance with an embodiment.

As shown in FIG. 9, additional middle candidates are added to the search pattern shown in FIG. 8. In one embodiment, the middle candidate can be added from the adjacent position. In another embodiment, the middle candidate can be added from the non-adjacent position.

The top left of the new block is treated as (S_(x),S_(y)). The above middle position Gi can be calculated as (S_(x)+(newWidth>>1), S_(y)−4), the left middle position Fi can be calculated as (S_(x)−4, S_(y)+(newHeight>>1). In another embodiment, the above middle position can be calculated as (S_(x)+(newWidth>>1)−4, S_(y)−4), the left middle position can be calculated as (S_(x)−4, S_(y)+(newHeight>>1)−4).

FIG. 10 is a diagram illustrating a search pattern in accordance with an embodiment.

In this method, the candidate block Ci is expanded in the horizontal direction, and the candidate block Di is expanded in the vertical direction. Each candidate block Ci has a grid size. The candidate block Ci's horizontal offset to candidate block C is i*gridX. In this case, “gridX” is the horizontal grid size. The candidate block Di's vertical offset to candidate block D is i*gridY.

In all of the above methods, it is proposed to constrain the maximum search rounds to be a predefined value such as “MaxSearchRounds,” which can be 1, 2, 3, 4, . . . , n. This value can be predefined at both encoder and decoder or signaled at SPS (sequence parameter set), PPS (picture parameter set) or slice header. In some cases, the search range does exceed the last 4×4 block row of the above CTU row. In another embodiment, the search range does not exceed a value for “MaxSearchRange.” This value can be predefined at both encoder and decoder or signaled at SPS, PPS or slice header. In another embodiment, the search range does not exceed the last above CTU row and the value for “MaxSearchRange.”

In another embodiment, the search range does not reach inside the left CTU. In all the above methods, the values for “gridX” and “gridY” are the searching gird. These values can be predefined for the encoder and decoder or signaled at SPS, PPS or slice header. The value of “gridX” can be any integer value that is a power of 2, or the current block width. The value of “gridY” can be any integer value that is a power of 2, or the current block height.

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof.

Acronyms

High Efficiency Video Coding (HEVC)

Coding unit (CU)

Prediction unit (PU)

Joint Exploration Model 7 (JEM 7)

Joint Video Exploration Team (JVET)

Alternative-temporal motion vector prediction (ATMVP)

Spatial-temporal motion vector prediction (STMVP)

Predicted (P) slice

Bi-directional predicted (B) slice

Rate-distortion (RD)

Temporal motion vector prediction (TMVP)

Context-adaptive binary arithmetic coding (CABAC)

Versatile Video Coding (VVC)

Sequence Parameter Set (SPS)

Picture Parameter Set (PPS)

Supplementary Enhancement Information (SEI) 

The invention claimed is:
 1. A method for generating a merge candidate list for encoding or decoding of a video sequence, the method comprising: performing a first search round; identifying a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) of a current block based on the first search round; performing an n-th search round using a horizontal grid value, that corresponds to a width of the current block, and a vertical grid value that corresponds to a height of the current block; identifying an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on performing the n-th search round using the horizontal grid value, that corresponds to the width of the current block, and the vertical grid value that corresponds to the height of the current block; and generating the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors, wherein one or more of the non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) is diagonally offset in a horizontal direction by the horizontal grid value, and diagonally offset in a vertical direction by the vertical grid value with respect to a corresponding non-adjacent spatial candidate block (A, B, C, D, and E).
 2. The method of claim 1, wherein a search order of the n-th search round is Ai, Bi, Ci, Di, and Ei.
 3. The method of claim 1, wherein Ai is offset horizontally from A by the horizontal grid value, Bi is offset vertically from B by the vertical grid value, Ci is offset diagonally from C by the horizontal grid value and the vertical grid value, Di is offset diagonally from D by the horizontal grid value and the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 4. The method of claim 1, wherein Ai is offset diagonally from A by the horizontal grid value and the vertical grid value, Bi is offset diagonally from B by the horizontal grid value and the vertical grid value, Ci is offset diagonally from C by the horizontal grid value and the vertical grid value, Di is offset diagonally from by the horizontal grid value and the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 5. The method of claim 1, further comprising: identifying motion vector predictors associated with middle candidate blocks (G, Gi, F, and Fi).
 6. The method of claim 1, wherein Ai is offset horizontally from A by the horizontal grid value, Bi is offset vertically from B by the vertical grid value, Ci is offset horizontally from C by the horizontal grid value, Di is offset vertically from D by the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 7. The method of claim 1, further comprising: determining whether a current search round is a maximum search round; and selectively performing another one or multiple search rounds based on whether the current search round is the maximum search round.
 8. The method of claim 1, wherein a search range does not exceed a last above coding tree unit (CTU) row.
 9. The method of claim 1, further comprising: determining that a search position is beyond a last above coding tree unit (CTU) row; and using motion data stored in the last 4×4 block row of the above CTU row based on the search position being beyond the last above CTU row.
 10. The method of claim 1, further comprising: determining whether a maximum search range is exceeded; and selectively performing another one or multiple search rounds based on whether the maximum search range is exceeded.
 11. A device for generating a merge candidate list for encoding or decoding of a video sequence, comprising: at least one memory configured to store program code; at least one processor configured to read the program code and operate as instructed by the program code, the program code including: performing code configured to cause the at least one processor to perform a first search round; identifying code configured to cause the at least one processor to identify a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) of a current block based on the first search round; wherein the performing code is further configured to cause the at least one processor to perform an n-th search round using a horizontal grid value, that corresponds to a width of the current block, and a vertical grid value that corresponds to a height of the current block; wherein the identifying code is further configured to cause the at least one processor to identify an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on performing the n-th search round using the horizontal grid value, that corresponds to the width of the current block, and the vertical grid value that cones ponds to the height of the current block; and generating code configured to cause the at least one processor to generate the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors, wherein one or more of the non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) is generally offset in a horizontal direction by the horizontal grid value, and diagonally offset in a vertical direction by the vertical grid value with respect to a corresponding non-adjacent spatial candidate block (A, B, C, D, and E).
 12. The device of claim 11, wherein a search order of the n-th search round is Ai, Bi, Ci, Di, and Ei.
 13. The device of claim 11, wherein Ai is offset horizontally from A by the horizontal grid value, Bi is offset vertically from B by the vertical value, Ci is offset diagonally from C by the horizontal grid value and the vertical grid value, Di is offset diagonally from D by the horizontal grid value and the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 14. The device of claim 11, wherein Ai is offset diagonally from A by the horizontal grid value and the vertical grid value, Bi is offset diagonally from B by the horizontal grid value and the vertical grid value, Ci is offset diagonally from C by the horizontal grid value and the vertical grid value, Di is offset diagonally from D by the horizontal grid value and the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 15. The device of claim 11, wherein the identifying code is further configured to cause the at least one processor to identify motion vector predictors associated with middle candidate blocks (G, Gi, F, and Fi).
 16. The device of claim 11, wherein Ai is offset horizontally from A by the horizontal grid value, Bi is offset vertically from B by the vertical grid value, Ci is offset horizontally from C by the horizontal grid value, Di is offset vertically from D by the vertical grid value, and Ei is offset diagonally from E by the horizontal grid value and the vertical grid value.
 17. The device of claim 11, further comprising: determining code that is configured to cause the at least one processor to determine whether a current search round is a maximum search round; and wherein the performing code is further configured to cause the at least one processor to selectively perform another one or multiple search rounds based on whether the current search round is the maximum search round.
 18. The device of claim 11, wherein a search range does not exceed a last above coding tree unit (CTU) row.
 19. The device of claim 11, further comprising: determining code that is configured to cause the at least one processor to determine whether a maximum search range is exceeded; and wherein the performing code is further configured to cause the at least one processor to selectively perform another one or multiple search rounds based on whether the maximum search range is exceeded.
 20. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of a device for generating a merge candidate list for encoding or decoding of a video sequence, cause the one or more processors to: perform a first search round; identify a first set of motion vector predictors associated with a set of adjacent spatial candidate blocks (A, B, C, D, and E) of a current block based on the first search round; perform an n-th search round using a horizontal grid value, that corresponds to a width of the current block, and a vertical grid value that corresponds to a height of the current block; identify an n-th set of motion vector predictors associated with a set of non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) based on performing the n-th search round using the horizontal grid value, that corresponds to the width of the current block, and the vertical grid value that corresponds to the height of the current block; and generate the merge candidate list using the first set of motion vector predictors and the n-th set of motion vector predictors, wherein one or more of the non-adjacent spatial candidate blocks (Ai, Bi, Ci, Di, and Ei) is diagonally offset in a horizontal direction by the horizontal grid value, and diagonally offset in a vertical direction by the vertical grid value with respect to a corresponding non-adjacent spatial candidate block (A, B, C, D, and E). 